Isomorphic limit ultrapowers for infinitary logic
نویسندگان
چکیده
The logic $${\mathbb{L}}_\theta ^1$$ was introduced in [She12]; it is the maximal below $${{\mathbb{L}}_{\theta, \theta}}$$ which a well ordering not definable. We investigate for θ compact cardinal. prove that satisfies several parallels of classical theorems on first order logic, strengthening thesis natural logic. In particular, two models are -equivalent iff some ω-sequence θ-complete ultrafilters, iterated ultrapowers by those isomorphic. Also strong limit λ>θ cofinality $${\aleph _0}$$ , every complete -theory has so-called special model cardinality λ, parallel saturated. For theory T and singular cardinal λ. Using “special” our context justified by: unique (fixing λ), all reducts too, so we have another proof interpolation this case.
منابع مشابه
Supervenience and Infinitary Logic
The discussion of supervenience is replete with the use of infinitary logical operations. For instance, one may often find a supervenient property that corresponds to an infinite collection of supervenience-base properties, and then ask about the infinite disjunction of all those base properties. This is crucial to a well-known argument of Kim (1984) that supervenience comes nearer to reduction...
متن کاملOmitting types for infinitary [0,1]-valued logic
We describe an infinitary logic for metric structures which is analogous to Lω1,ω . We show that this logic is capable of expressing several concepts from analysis that cannot be expressed in finitary continuous logic. Using topological methods, we prove an omitting types theorem for countable fragments of our infinitary logic. We use omitting types to prove a two-cardinal theorem, which yields...
متن کاملInfinitary Domain Logic for Finitary Transition Systems
The Lindenbaum algebra generated by the Abramsky ni-tary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We extend Abramsky's result by proving that the Lindenbaum algebra generated by the innnitary logic is a completely distributive lattice dual to the same SFP-domain. As a consequence soundness and completeness of the innnitary logi...
متن کاملNon-Denumerable Infinitary Modal Logic
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...
متن کاملCoinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic
We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform way. We define ∞ =, the infinitary extension of a given equational theory =R, and →∞, the standard notion of infinitary rewriting associated to a reduction relation →R, as follows: ∞ = := νR. (=R ∪ R) → := μR. νS. (→R ∪ R) ; S Here μ and ν are the leas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2021
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-021-2226-x